simulated annealing

Terms from Artificial Intelligence: humans at the heart of algorithms

Simulated annealing is a form of stochastic hill-climbing, which takes its inspiration from crytsal formation during annealing in metals. The basic ide is that form a given point nearby states in the fitness landscape are explored (by making small peturbations to the state). In standard hill-climbing the best next state is chosen, but in simukated annealing the next state is chosen stchastically, with probability based on the exponential of the {[fitness function}}. A 'temperature' parameter changes this behavious staring hot, meaning that changes to less good states re more likely (allowing exploration), but getting gradually cooler meaning ot hehaves more liek normal best first hill-climbing. The effecr is that the eaerky stages find the best geberal area of the {[fitness landscape}} whereas the later, cool, stage makes fine adjustments within that area.
Note that due to the anealing analogy shich is about energy minimisation, lower values are usually deemed 'good' in simulated annealing, so that it is more like a marble rolling downhill towards the lowest point, but with lots of energy initially so that it doesn't get stuck in local mimima.

Defined on pages 76, 76

Used on pages 76, 77, 81, 143, 185, 186, 446